Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
نویسندگان
چکیده
منابع مشابه
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs Ueli M. Maurer Institute for Signal and Information Processing Swiss Federal Institute of Technology CH-8092 Z urich, Switzerland Abstract. The number of cycles of length k that can be generated by q-ary n-stage feedback shift-registers is studied. This problem is equivalent to nding the number of cycles o...
متن کاملGeneralized de Bruijn Cycles
For a set of integers I, we define a q-ary I-cycle to be an assignment of the symbols 1 through q to the integers modulo qn so that every word appears on some translate of I. This definition generalizes that of de Bruijn cycles, and opens up a multitude of questions. We address the existence of such cycles, discuss “reduced” cycles (ones in which the all-zeroes string need not appear), and prov...
متن کاملHamiltonicity of large generalized de Bruijn cycles
In this article, we determine when the large generalized de Bruijn cycles BGC(p, d, n) are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized p-cycles. They are the Kronecker product of the generalized de Bruijn digraph GB(d, n) and the dicycle of length p, where GB(d, n) is the...
متن کاملColouring of cycles in the de bruijn graphs
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k − 1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de B...
متن کاملOn the Representation of de Bruijn Graphs
The de Bruijn graph plays an important role in bioinformatics, especially in the context of de novo assembly. However, the representation of the de Bruijn graph in memory is a computational bottleneck for many assemblers. Recent papers proposed a navigational data structure approach in order to improve memory usage. We prove several theoretical space lower bounds to show the limitations of thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90149-5